Generalized Rayleigh Quotient Shift Strategy in QR Algorithm for Eigenvalue Problems
نویسندگان
چکیده
QR algorithm for eigenproblems is often applied with single or double shift strategies. To save computation effort, double implicit shift technique is employed. In Watkins and Elsner[1], a higher-order shift strategy, generalized Rayleigh quotient shift strategy, is introduced. In this paper, we give a generalization of the double implicit shift technique for the higher-order strategy, and compare the computation cost for different orders with numerical experiments.
منابع مشابه
A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence
In 1989, Bai and Demmel proposed the multishift QR algorithm for eigenvalue problems. Although the global convergence property of the algorithm (i.e., the convergence from any initial matrix) still remains an open question for general nonsymmetric matrices, in 1992 Jiang focused on symmetric tridiagonal case and gave a global convergence proof for the generalized Rayleigh quotient shifts. In th...
متن کاملRayleigh Quotient Iteration and Simplified Jacobi-davidson with Preconditioned Iterative Solves for Generalised Eigenvalue Problems
The computation of a right eigenvector and corresponding finite eigenvalue of a large sparse generalised eigenproblem Ax = λMx using preconditioned Rayleigh quotient iteration and the simplified JacobiDavidson method is considered. Both methods are inner-outer iterative methods and we consider GMRES and FOM as iterative algorithms for the (inexact) solution of the inner systems that arise. The ...
متن کاملThe Effect of Aggressive Early Deflation on the Convergence of the QR Algorithm
Aggressive early deflation has proven to significantly enhance the convergence of the QR algorithm for computing the eigenvalues of a nonsymmetric matrix. One purpose of this paper is to point out that this deflation strategy is equivalent to extracting converged Ritz vectors from certain Krylov subspaces. As a special case, the single-shift QR algorithm enhanced with aggressive early deflation...
متن کاملA Jacobi-Davidson Method for Solving Complex Symmetric Eigenvalue Problems
We discuss variants of the Jacobi–Davidson method for solving the generalized complex-symmetric eigenvalue problem. The Jacobi–Davidson algorithm can be considered as an accelerated inexact Rayleigh quotient iteration. We show that it is appropriate to replace the Euclidean inner product xy in C by the bilinear form x y. The Rayleigh quotient based on this bilinear form leads to an asymptotical...
متن کاملControllability Properties of Numerical Eigenvalue Algorithms
We analyze controllability properties of the inverse iteration and the QR-algorithm equipped with a shifting parameter as a control input. In the case of the inverse iteration with real shifts the theory of universally regular controls may be used to obtain necessary and suucient conditions for complete controllability in terms of the solvability of a matrix equation. Partial results on conditi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004